Covering group theory for topological groups
نویسندگان
چکیده
منابع مشابه
Covering theory for complexes of groups
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and isometry of universal covers. We characterize faithful complexes of groups and prove a conjugacy theorem for groups acting freely on polyhedral complexes. We a...
متن کاملCovering Groups of Non-connected Topological Groups Revisited
All spaces are assumed to be locally path connected and semi-locally 1-connected. Let X be a connected topological group with identity e, and let p : X̃ → X be the universal cover of the underlying space of X. It follows easily from classical properties of lifting maps to covering spaces that for any point ẽ in X̃ with pẽ = e there is a unique structure of topological group on X̃ such that ẽ is th...
متن کاملPolish Groups Topological Groups a Topological Group Is a Group G with a Topology on G for Which the Operations
These notes introduce the reader to Polish groups|topological groups in which the underlying space is Polish. No background in topological groups is assumed, but I will present the material fairly rapidly and leave quite a lot for the reader to check on his or her own. My main motivation for writing such notes arises from the applications and connections in model theory, where closed subgroups ...
متن کاملGroup Theory Permutation Groups
Finite Groups 20Dxx [1] A. Adem, J. F. Carlson, D. B. Karagueuzian, and R. James Milgram, The cohomology of the Sylow 2-subgroup of the Higman-Sims group, J. Pure Appl. Algebra 164 (2001), no. 3, 275–305. MR MR1857743 (2002g:20089) [2] Faryad Ali and Jamshid Moori, Fischer-Clifford matrices of the non-split group extension 2 · U4(2), Quaest. Math. 31 (2008), no. 1, 27–36. MR MR2404644 [3] Habib...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2001
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(00)00031-6